A vector-space packing problem
نویسندگان
چکیده
منابع مشابه
Menger probabilistic normed space is a category topological vector space
In this paper, we formalize the Menger probabilistic normed space as a category in which its objects are the Menger probabilistic normed spaces and its morphisms are fuzzy continuous operators. Then, we show that the category of probabilistic normed spaces is isomorphicly a subcategory of the category of topological vector spaces. So, we can easily apply the results of topological vector spaces...
متن کاملBin Packing Problem: a Linear Constant- Space -approximation Algorithm
Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algorithms have been suggested for it. It has been proven that the best algorithm for BPP has the approximation ratio of and the time order of ( ), unless = . In the current paper, a linear approximation algorithm is presented. The suggested algorithm not only has the best possible theoretical factor...
متن کاملOnline Submodular Maximization Problem with Vector Packing Constraint
We consider the online vector packing problem in which we have a d dimensional knapsack and items u with weight vectors wu ∈ R+ arrive online in an arbitrary order. Upon the arrival of an item, the algorithm must decide immediately whether to discard or accept the item into the knapsack. When item u is accepted, wu(i) units of capacity on dimension i will be taken up, for each i ∈ [d]. To satis...
متن کاملVector Space semi-Cayley Graphs
The original aim of this paper is to construct a graph associated to a vector space. By inspiration of the classical definition for the Cayley graph related to a group we define Cayley graph of a vector space. The vector space Cayley graph ${rm Cay(mathcal{V},S)}$ is a graph with the vertex set the whole vectors of the vector space $mathcal{V}$ and two vectors $v_1,v_2$ join by an edge whenever...
متن کاملSequential Vector Packing
We introduce a novel variant of the well known d-dimensional bin (or vector) packing problem. Given a sequence of non-negative d-dimensional vectors, the goal is to pack these into as few bins as possible. In the classical problem the bin size vector is given and the sequence can be partitioned arbitrarily. We study a variation where the vectors have to be packed in the order in which they arri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1966
ISSN: 0021-8693
DOI: 10.1016/0021-8693(66)90024-x